Integer Nc 1 Is Equal to Boolean Nc 1
نویسنده
چکیده
We show that the product of n 3 3 matrices of n-bit integers can be computed in P -uniform FNC1. Since this problem is complete [BOC92] for formul in f+; g on n-bit integers, we conclude that \algebraic NC1" on integers is equal to the usual Boolean notion of NC1 functions.
منابع مشابه
Separation of the Monotone NC Hierarchy
We prove tight lower bounds, of up to n , for the monotone depth of functions in monotone-P. As a result we achieve the separation of the following classes. 1. monotone-NC 6 = monotone-P. 2. For every i 1, monotone-NC i 6 = monotone-NC i+1. 3. More generally: For any integer function D(n), up to n (for some > 0), we give an explicit example of a monotone Boolean function, that can be computed b...
متن کاملNondeterministic NC1 Computation
We deene the counting classes #NC 1 , GapNC 1 , PNC 1 and C = NC 1. We prove that boolean circuits, algebraic circuits, programs over non-deterministic nite automata, and programs over constant integer matrices yield equivalent deenitions of the latter three classes. We investigate closure properties. We observe that #NC 1 #L, that PNC 1 L, and that C = NC 1 L. Then we exploit our nite automato...
متن کاملChipping Away at P vs NP: How Far Are We from Proving Circuit Size Lower Bounds?
Many people are pessimistic about seeing a resolution to the P vs NP question any time soon. This pessimism extends also to questions about other important complexity classes, including two classes that will be the focus of this talk: TC 0 and NC 1. TC 0 captures the complexity of several important computational problems, such as multiplication, division, and sorting; it consists of all problem...
متن کاملCircuits over PP and PL 1
Wilson's (1985, J. Comput. System. Sci. 31, 169 181) model of oracle gates provides a framework for considering reductions whose strength is intermediate between truth-table and Turing. Improving on a stream of previously published results, we prove that PL and PP are closed under NC1 reductions. This answers an open problem of Ogihara (1996, ``Proc. 37th Ann. IEEE Symp. Found. Computer Sci.'')...
متن کاملInteger Division Is in Nc 1
An NC 1 circuit for division of binary numbers is presented. By results of Beame, Cook and Hoover this also shows that iterated product and powering are in NC 1 , and by a result of Borodin all three operations are in log-space. This settles an open issue in parallel and space bounded arithmetic complexity.
متن کامل